全文获取类型
收费全文 | 1230篇 |
免费 | 166篇 |
国内免费 | 56篇 |
专业分类
化学 | 107篇 |
力学 | 66篇 |
综合类 | 39篇 |
数学 | 772篇 |
物理学 | 468篇 |
出版年
2024年 | 2篇 |
2023年 | 29篇 |
2022年 | 40篇 |
2021年 | 46篇 |
2020年 | 62篇 |
2019年 | 44篇 |
2018年 | 44篇 |
2017年 | 48篇 |
2016年 | 53篇 |
2015年 | 27篇 |
2014年 | 67篇 |
2013年 | 96篇 |
2012年 | 43篇 |
2011年 | 58篇 |
2010年 | 43篇 |
2009年 | 80篇 |
2008年 | 90篇 |
2007年 | 82篇 |
2006年 | 82篇 |
2005年 | 62篇 |
2004年 | 66篇 |
2003年 | 34篇 |
2002年 | 38篇 |
2001年 | 46篇 |
2000年 | 26篇 |
1999年 | 37篇 |
1998年 | 25篇 |
1997年 | 18篇 |
1996年 | 11篇 |
1995年 | 10篇 |
1994年 | 10篇 |
1993年 | 6篇 |
1992年 | 2篇 |
1991年 | 4篇 |
1990年 | 5篇 |
1989年 | 3篇 |
1988年 | 5篇 |
1987年 | 1篇 |
1986年 | 2篇 |
1985年 | 1篇 |
1983年 | 1篇 |
1971年 | 2篇 |
1969年 | 1篇 |
排序方式: 共有1452条查询结果,搜索用时 234 毫秒
21.
We prove two new upper bounds on the size of binary codes with a minimum distance of three, namelyA(10, 3)76 andA(11, 3)152. 相似文献
22.
It is shown how to represent algebraically all functions that have a zero sum on all -dimensional subspaces ofPG(n,q) or ofAG(n,q). In this way one can calculate the dimensions of related codes, or one can represent interesting sets of points by functions. 相似文献
23.
E.?A.?CastroEmail author A.?P.?Toropova A.?A.?Toropov D.?V.?Mukhamedjanova 《Structural chemistry》2005,16(3):305-324
We examine the encoding of chemical structure of organic compounds by Labeled Hydrogen-Filled Graphs (LHFGs). Quantitative Structure-Property Relationships (QSPR) for a representative set of 150 organic molecules have been derived by means of the optimization of correlation weights of local invariants of the LHFGs. We have tested as local invariants Morgan extended connectivity of zero- and first order, numbers of path of length 2 (P2) and valence shells of distance of 2 (S2) associated with each atom in the molecular structure, and the Nearest Neighboring Codes (NNC). The best statistical characteristics for the Gibbs free energy has been obtained for the NNC weighting. Statistical parameters corresponding to this model are the following n = 100, r2 = 0.9974, s = 5.136 kJ/mol, F = 38319 (training set); n = 50, r2 = 0.9990, s = 3.405 kJ/mol, F = 48717 (test set). Some possible further developments are pointed out. 相似文献
24.
Difference systems of sets (DSS) are combinatorial configurations that arise in connection with code synchronization. This paper proposes a new method to construct DSSs, which uses known DSSs to partition some of the cosets of Zv relative to subgroup of order k, where v = km is a composite number. As applications, we obtain some new optimal DSSs. 相似文献
25.
《Indagationes Mathematicae》2017,28(1):91-107
Primitive constant length substitutions generate minimal symbolic dynamical systems. In this article we present an algorithm which can produce the list of injective substitutions of the same length that generate topologically conjugate systems. We show that each conjugacy class contains infinitely many substitutions which are not injective. As examples, the Toeplitz conjugacy class contains three injective substitutions (two on two symbols and one on three symbols), and the length two Thue–Morse conjugacy class contains twelve substitutions, among which are two on six symbols. Together, they constitute a list of all primitive substitutions of length two with infinite minimal systems which are factors of the Thue–Morse system. 相似文献
26.
研究给出了一类基于循环码的常重复合码的构造,并利用指数和计算其参数.与相关的常重复合码相比,该码具有更多的码字,且渐近性较好. 相似文献
27.
We introduce the concept of a pentagonal geometry as a generalization of the pentagon and the Desargues configuration, in the same vein that the generalized polygons share the fundamental properties of ordinary polygons. In short, a pentagonal geometry is a regular partial linear space in which for all points x, the points not collinear with the point x, form a line. We compute bounds on their parameters, give some constructions, obtain some nonexistence results for seemingly feasible parameters and suggest a cryptographic application related to identifying codes of partial linear spaces. 相似文献
28.
王永平 《数学的实践与认识》2014,(6)
在语言图Γ(X*)概念的基础上,用新引入的语言竹竿l(X*)和语言竹竿集L(X*)的概念形象地刻画了前缀码与极大前缀码:A是前缀码l(X*)∈L(X*),S_l_((X*))∩A或为单点集或为Φ;A是极大前缀码l(X*)∈L(X*),i)S_(l(X*))∩A或为单点集或为Φ.ii)S_(l(X*))∩A=Φ■u∈S_(l(X*)),■a∈A,ω∈X~+使a=uw. 相似文献
29.
Hai Q. Dinh Xiaoqiang Wang Hongwei Liu Songsak Sriboonchitta 《Discrete Mathematics》2019,342(5):1456-1470
Let be an odd prime, , be positive integers, be nonzero elements of the finite field such that . In this paper, we show that, for any positive integer , the Hamming distances of all repeated-root -constacyclic codes of length can be determined by those of certain simple-root -constacyclic codes of length . Using this result, Hamming distances of all constacyclic codes of length are obtained. As an application, we identify all MDS -constacyclic codes of length . 相似文献
30.
Is it true that every matching in the n-dimensional hypercube can be extended to a Gray code? More than two decades have passed since Ruskey and Savage asked this question and the problem still remains open. A solution is known only in some special cases, including perfect matchings or matchings of linear size. This article shows that the answer to the Ruskey–Savage problem is affirmative for every matching of size at most . The proof is based on an inductive construction that extends balanced matchings in the completion of the hypercube by edges of into a Hamilton cycle of . On the other hand, we show that for every there is a balanced matching in of size that cannot be extended in this way. 相似文献